Performance of IP address auto-configuration protocols in Delay and Disruptive Tolerant Networks

At this moment there is a lack of research respecting Mobile Ad-hoc Networks (MANET) address assignment methods used in Delay Tolerant Networks (DTN). The goal of this paper is to review the SDAD, WDAD and Buddy methods of IP address assignment known from MANET in difficult environment of Delay and Disruptive Tolerant Networks. Our research allows us for estimating the effectiveness of the chosen solution and, therefore, to choose the most suitable one for specified conditions. As a part of the work we have created a tool which allows to compare these methods in terms of capability of solving address conflicts and network load. Our simulator was created from scratch in Java programming language in such a manner, that implementation of new features and improvements in the future will be as convenient as possible

SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions

Delay Tolerant Networks over Near Field Communications: The Automatic Multi-packet Communication

The Near Field Communication is designed for sending small data, which size does not exceed the several dozen bytes, for distance not higher than two inches. The NFC can be used in store-carry-forward scenarios which are bases for Disruptive Tolerant Networks. The aim of this paper is proposal how to use NFC in transmission of large data in DTN. We propose an algorithm of fragmenting, sending and receiving data. We described software which was used in our prototype and discussed about implementation. Finally we showed results of tests performed on our model. Obtained results presents well characteristics of our solution

Improving DTNs Performance by Reduction of Bundles Redundancy using Clustering Algorithm

This article presents complex clustering algorithm for Delay Tolerant Networks (DTNs) including neighborhood discovery, cluster creation, and data distribution within cluster. The general idea is to reduce the amount of messages being sent and of buffer utilization, by taking advantage of the nodes tendency to create groups and to share similar mobility patterns among each other. The main purpose of the algorithm is to improve the network performance without major changes in communication schemes between nodes. Almost no extra message type is added. Most extra features are available thanks to adding small extra fields into transmitted packages. Neighborhood discovery is being realized passively by listening to other nodes messages. The proposed algorithms allow to reduce both the bandwidth occupation, as well as the problems related to the media access. Furthermore, it can increase message delivery probability thanks to intelligent package distribution inside created cluster. Simulations were carried out to evaluate the effectiveness of the proposed solution in terms of package delivery probability, mean buffer occupancy and mean hop number to delivery the message. Results of simulation show that this solution is not necessary or recommended for small-scale networks with few nodes using clustering algorithms. However, with increasing number of nodes and messages, the performance of non-clustered DTNs drops significantly while clustered network works efficiently

RBCP-WSN: The Reliable Biderectional Control Protocol for Wireless Sensor Networks

This paper presents the Reliable Bidirectional Control Protocol (RBCP) protocol, which is a transport protocol for Wireless Sensor Networks (WSN), focused on managing sensors’ behaviour. It aims to be a utility for reliable control data transferring from source to destination unit in the network. Considering the related studies on transport protocols, which are mostly dedicated to a single-direction reliable data transport, RBCP is the answer for the lack of control mechanisms in WSNs based on bidirectional communication. The first part of this paper is focused on general presentation of the proposed solution. In the next part, evaluation of the idea and final functionality are discussed. It will finally show the results of undergone testing stage

The channel for hidden data transmission in WSN

This paper describes an idea and realisation of hidden data transmision using Tiny Aggregation Covert Channel (TAGCC)in Wireless Sensor Networks. Our solution uses data aggregation mechanism called Tiny Aggregation (TAG). The protocol is based on idea of hidden messages sending without generate additional data packets and encryption. The paper describes details of proposed algorithm and simulation results obtained during testing of the sensor networks with hidden channel TAGCC

Concept-Based Routing in Ad-Hoc Networks 1

Abstract. In concept-addressable messaging, network nodes are both described and addressed by concepts derived from an ontology domain model. The paper presents a routing protocol for the concept-addressable messaging in mobile adhoc networks. The domain model is a taxonomy, and the address is any concept from the taxonomy. The protocol uses restricted flooding (narrowcasting) to deliver concept-addressed messages. To that end, nodes' conceptual descriptions are proactively spread with Hello messages. If there is not enough room in the Hello message, selected descriptions are moved to a higher abstraction level and merged. The protocol is a single layer solution (not an overlay). Preliminary ns2-based performance results are provided